Uniqueness of varieties of minimal degree containing a given scheme
نویسندگان
چکیده
منابع مشابه
The Minimal Number of Subtrees with a Given Degree Sequence
In this paper, we investigate the structures of extremal trees which have the minimal number of subtrees in the set of all trees with a given degree sequence. In particular, the extremal trees must be caterpillar and but in general not unique. Moreover, all extremal trees with a given degree sequence π = (d1, . . . , d5, 1, . . . , 1) have been characterized.
متن کاملGerms of Integrable Forms and Varieties of Minimal Degree
We study the subvariety of integrable 1-forms in a finite dimensional vector space W ⊂ Ω(C, 0). We prove that the irreducible components with dimension comparable with the rank of W are of minimal degree.
متن کاملOn the Universal Gröbner Bases of Varieties of Minimal Degree
A universal Gröbner basis of an ideal is the union of all its reduced Gröbner bases. It is contained in the Graver basis, the set of all primitive elements. Obtaining an explicit description of either of these sets, or even a sharp degree bound for their elements, is a nontrivial task. In their ’95 paper, Graham, Diaconis and Sturmfels give a nice combinatorial description of the Graver basis f...
متن کاملSums of Squares and Varieties of Minimal Degree
The study of nonnegativity and its relation with sums of squares is a basic challenge in real algebraic geometry. The classification of varieties of minimal degree is one of the milestones of classical complex algebraic geometry. The goal of this paper is to establish the deep connection between these apparently separate topics. To achieve this, let X ⊆ P be an embedded real projective variety ...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2003
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-03-03421-4